Exact real number computations relative to hereditarily total functionals
نویسندگان
چکیده
منابع مشابه
Exact real number computations relative to hereditarily total functionals
We show that the continuous existential quantifier ∃ω is not definable in Escardó’s Real-PCF from all functionals equivalent to a given total one in a uniform way. We further prove that relative to any total functional of type (I → I) → I which gives the maximum-value for any total input, we may, given a computable, total functional Φ of type (R → R) → R find a Real-PCF definable total Ψ equiva...
متن کاملHereditarily Sequential Functionals
In order to deene models of simply typed functional programming languages being closer to the operational semantics of these languages, the notions of sequentiality, stability and seriality were introduced. These works originated from the deenability problem for PCF, posed in Sco72], and the full abstraction problem for PCF, raised in Plo77]. The presented computation model, forming the class o...
متن کاملLazy Functional Algorithms for Exact Real Functionals
We show how functional languages can be used to write programs for real-valued functionals in exact real arithmetic. We concentrate on two useful functionals: deenite integration, and the functional returning the maximum value of a continuous function over a closed interval. The algorithms are a practical application of a method, due to Berger, for computing quantiiers over streams. Correctness...
متن کاملExact real arithmetic for interval number systems
An interval number system is given by an initial interval cover of the extended real line and by a finite system of nonnegative Möbius transformations. Each sequence of transformations applied to an initial interval determines a sequence of nested intervals whose intersection contains a unique real number. We adapt in this setting exact real algorithms which compute arithmetical operations to a...
متن کاملn-Monotone exact functionals
We study n-monotone functionals, which constitute a generalisation of n-monotone set functions. We investigate their relation to the concepts of exactness and natural extension, which generalise coherence and natural extension in the behavioural theory of imprecise probabilities. We improve upon a number of results in the literature, and prove among other things a representation result for exac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00100-1